ordered sets , and submodular functions
نویسندگان
چکیده
Recent developments in the use of greedy algorithms in linear programming are reviewed and extended. We find a common generalization of some theorems of Queyranne–Spieksma– Tardella, Faigle–Kern, and Fujishige about greedy algorithms for linear programs in diverse contexts. Additionally, we extend a well-known theorem of Topkis about submodular functions on the product of chains to submodular functions on the product of lattices.
منابع مشابه
Some Results about the Contractions and the Pendant Pairs of a Submodular System
Submodularity is an important property of set functions with deep theoretical results and various applications. Submodular systems appear in many applicable area, for example machine learning, economics, computer vision, social science, game theory and combinatorial optimization. Nowadays submodular functions optimization has been attracted by many researchers. Pendant pairs of a symmetric...
متن کاملTripled partially ordered sets
In this paper, we introduce tripled partially ordered sets and monotone functions on tripled partiallyordered sets. Some basic properties on these new dened sets are studied and some examples forclarifying are given.
متن کاملEfficient Determination of Gibbs Estimators with Submodular Energy Functions
Now the Gibbs estimators are used to solve many problems in computer vision, optimal control, Bayesian statistics etc. Their determination is equivalent to minimization of corresponding energy functions. Therefore, the real use of the estimators is restricted by opportunity to compute or evaluate satisfactory values of the energy functions. New combinatorial techniques that have been developed ...
متن کاملWeakly submodular rank functions, supermatroids, and the flat lattice of a distributive supermatroid
Distributive supermatroids generalize matroids to partially ordered sets. Completing earlier work of Barnabei, Nicoletti and Pezzoli we characterize the lattice of flats of a distributive supermatroid. For the prominent special case of a polymatroid the description of the flat lattice is particularly simple. Large portions of the proofs reduce to properties of weakly submodular rank functions. ...
متن کاملAn algebraic framework for the greedy algorithm with applications to the core and Weber set of cooperative games
An algebraic model generalizing submodular polytopes is presented, where modular functions on partially ordered sets take over the role of vectors in R . This model unifies various generalizations of combinatorial models in which the greedy algorithm and the Monge algorithm are successful and generalizations of the notions of core and Weber set in cooperative game theory. As a further applicati...
متن کامل